| 翻訳と辞書 |
| completely multiplicative function ： ウィキペディア英語版 |
completely multiplicative function
In number theory, functions of positive integers which respect products are important and are called completely multiplicative functions or totally multiplicative functions. A weaker condition is also important, respecting only products of coprime numbers, and such functions are called multiplicative functions. Outside of number theory, the term "multiplicative function" is often taken to be synonymous with "completely multiplicative function" as defined in this article.
==Definition==
A completely multiplicative function (or totally multiplicative function) is an arithmetic function (that is, a function whose domain is the natural numbers), such that ''f''(1) = 1 and ''f''(''ab'') = ''f''(''a'') ''f''(''b'') holds ''for all'' positive integers ''a'' and ''b''.
Without the requirement that ''f''(1) = 1, one could still have ''f''(1) = 0, but then ''f''(''a'') = 0 for all positive integers ''a'', so this is not a very strong restriction.
The definition above can be rephrased using the language of algebra: A completely multiplicative function is an endomorphism of the monoid , that is, the positive integers under multiplication.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「completely multiplicative function」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|